Regular Polytopes in Ordinary Space

Regular Polytopes in Ordinary Space

The three aims of this paper are to obtain the proof by Dress of the completeness of the enumeration of the Grünbaum–Dress polyhedra (that is, the regular apeirohedra, or apeirotopes of rank 3) in ordinary space E3 in a quicker and more perspicuous way, to give presentations of those of their symmetry groups which are affinely irreducible, and to describe all the discrete regular apeirotopes of...

Regular polytopes

Regular Polytopes in Z

In [3], all embeddings of regular polyhedra in the three dimensional integer lattice were characterized. Here, we prove some results toward solving this problem for all higher dimensions. Similarly to [3], we consider a few special polytopes in dimension 4 that do not have analogues in higher dimensions. We then begin a classification of hypercubes, and consequently regular cross polytopes in t...

1 Classical Regular Polytopes

Our purpose in this introductory chapter is to set the scene for the rest of the book. We shall do this by briefly tracing the historical development of the subject. There are two main reasons for this. First, we wish to recall the historical traditions which lie behind current research. It is all too easy to lose track of the past, and it is as true inmathematics as in anything else that those...

Spectra of Regular Polytopes

Introduction As is well known, the combinatorial problem of counting paths of length n between two xed vertices in a graph reduces to raising the adjacency matrix A of the graph to the n-th power ((B], p. 11). For an undirected graph, A is symmetric and the problem above simpliies considerably if its spectrum (A) is known and contains few distinct elements. Spectra of graphs, meaning spectra of...